Bounded MSC communication

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded MSC Communication

Message sequence charts (MSCs) and high-level message sequence charts (HMSCs) are popular formalisms for the speciication of communication protocols between asynchronous processes. An important concept in this context is the size of the communication buuers used between processes. Since real systems impose limitations on the capacity (or speed) of communication links, we ask whether a given HMS...

متن کامل

Auctions with Severely Bounded Communication

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfareand profit-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove non-surprising properties of ...

متن کامل

Communication in Bounded Depth Circuits

We show that rigidity of matrices can be used to prove lower bounds on depth 2 circuits and communication graphs. We prove a general nonlinear lower bound on a certain type of circuits and thus, in particular, we determine the asymptotic size of depth d superconcentrators for all depths 4 (for even depths 4 it has been determined before).

متن کامل

Dimensioning of communication links for base-station and MSC interconnection in CDMA mobile communication systems

In CDMA mobile communication systems, voice is encoded and packaged in variable length packets that are transported between the mobile station and the switching center. While the packetization provides a great flexibility in resource allocation, it poses a QOS challenge on voice. In this paper, we discuss link dimensioning for a typical CDMA system. We consider a communication link connecting a...

متن کامل

Stochastically Bounded Burstiness for Communication Networks

A network calculus is developed for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus is useful for a large class of input processes, including important processes exhibiting “subexponentially bounded burstiness” such as fractional Brownian motion. Moreover, it allows judicious capture of the salient features of real-time traffic, such as the “c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2004

ISSN: 0890-5401

DOI: 10.1016/j.ic.2003.10.002